Robust Behaviorally Correct Learning

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Behaviourally Correct Learning

Intuitively, a class of functions is robustly learnable if not only the class itself, but also all of the transformations of the class under natural transformations (such as via general recursive operators) are learnable. Fulk [Ful90] showed the existence of a non-trivial class which is robustly learnable under the criterion Ex. However, several of the hierarchies (such as the anomaly hierarchi...

متن کامل

Probably Approximately Correct Learning

This paper surveys some recent theoretical results on the efficiency of machine learning algorithms. The main tool described is the notion of Probably Approximately Correct (PAC) 1 earning, introduced by Valiant. We define this learning model and then look at sorne of the results obtained in it. We then consider some criticisms of the PAC model and the extensions proposed to address these criti...

متن کامل

Probably Approximately Correct Learning

Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm. of empirical and explanation-based learning algo

متن کامل

Learning Behaviorally Grounded State Representations for Reinforcement Learning Agents

The learning and reasoning capabilities of biological systems by far exceed those of robots and artificial agents. Part of this stems from their ability to efficiently learn behavioral skills and increasingly complex, symbolic representations that capture the important aspects of their environment. This paper presents an autonomous learning approach by which artificial reinforcement learning ag...

متن کامل

Logically-Correct Reinforcement Learning

We propose a novel Reinforcement Learning (RL) algorithm to synthesize policies for a Markov Decision Process (MDP), such that a linear time property is satisfied. We convert the property into a Limit Deterministic Büchi Automaton (LDBA), then construct a product MDP between the automaton and the original MDP. A reward function is then assigned to the states of the product automaton, according ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 1999

ISSN: 0890-5401

DOI: 10.1006/inco.1999.2805